An Iteration-free Fast Multilevel Solver for Dense Method of Moment Systems
نویسندگان
چکیده
A fast multilevel direct solver for the Method of Moments applied to electrically small structures is presented. The approach is based on a combination of low-rank decompositions and fill-in control. It is particularly advantageous for multiple right-hand-side problems such as those encountered in digital circuit and IC analyses, as is demonstrated by numerical simulation results presented here.
منابع مشابه
Experiments on Iterative Methods and the Fast Multipole Method in Electromagnetic Scattering Calculations
We describe the iterative solution of dense linear systems arising from a surface integral equation of electromagnetic scattering. The complex symmetric version of QMR has been used as an iterative solver together with a sparse approximate inverse preconditioner. The preconditioner is computed using the topological information from the computational mesh. The matrix-vector products are computed...
متن کاملA multilevel algorithm for inverse problems with elliptic PDE constraints
We present a multilevel algorithm for the solution of a source identification problem in which the forward problem is an elliptic partial differential equation on the 2D unit box. The Hessian corresponds to a Tikhonov-regularized first-kind Fredholm equation. Our method uses an approximate Hessian operator for which, first, the spectral decomposition is known, and second, there exists a fast al...
متن کاملA Particle-Partition of Unity Method Part VII: Adaptivity
This paper is concerned with the adaptive multilevel solution of elliptic partial differential equations using the partition of unity method. While much of the work on meshfree methods is concerned with convergence-studies, the issues of fast solution techniques for the discrete system of equations and the construction of optimal order algorithms are rarely addressed. However, the treatment of ...
متن کاملFast Multipole Preconditioners for Sparse Matrices Arising from Elliptic Equations
Among optimal hierarchical algorithms for the computational solution of elliptic problems, the Fast Multipole Method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and relaxable global synchronization requirements. We demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel rep...
متن کاملFAST ILLINOIS SOLVER CODE ( FISC ) yJ
|-FISC (Fast Illinois Solver Code) is designed to compute RCS of a target described by a triangular facet le. The problem is formulated by the method of moments (MoM), where the RWG (Rao, Wilton, and Glisson) basis functions are used. The resultant matrix equation is solved iteratively by the conjugate gradient (CG) method. The multilevel fast multipole algorithm (MLFMA) is used to speed up the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001